On block pumpable languages

On block pumpable languages

On the Hierarchy of Block Deterministic Languages

A regular language is k-lookahead deterministic (resp. k-block deterministic) if it is specified by a k-lookahead deterministic (resp. k-block deterministic) regular expression. These two subclasses of regular languages have been respectively introduced by Han and Wood (k-lookahead determinism) and by Giammarresi et al. (k-block determinism) as a possible extension of one-unambiguous languages ...

Block-Deterministic Regular Languages

We introduce the notions of blocked, block-marked and block-deterministic regular expressions. We characterize block-deterministic regular expressions with determin-istic Glushkov block automata. The results can be viewed as a generalization of the characterization of one-unambiguous regular expressions with deterministic Glushkov automata. In addition, when a language L has a block-determinist...

Block-Level Parallelism in Parsing Block Structured Languages

Softwares source code is becoming large and complex. Compilation of large base code is a time consuming process. Parallel compilation of code will help in reducing the time complexity. Parsing is one of the phases in compiler in which significant amount of time of compilation is spent. Techniques have already been developed to extract the parallelism available in parser. Current LR(k) parallel ...

Block Shelves for Visual Programming Languages

The blocks editor, such as the editor in Scratch [13], is widely applied for visual programming languages (VPL) nowadays. Despite it’s friendly for non-programmers, it exists three main limitations while displaying block codes: (1) the readability, (2) the program structure, and (3) the re-use. To cope with these issues, we introduce a novel formatting tool, block shelves, into the editor for o...